On Fibonacci numbers with few prime divisors

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On intervals with few prime numbers

We prove that there are long intervals containing fewer prime numbers than the average for intervals of such length.

متن کامل

Intervals with few Prime Numbers

I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I authorize the University of Waterloo to lend this thesis to other institutions or individuals for the purpose of scholary research and I understand that my thesis may be made electonically available to the public. iii This thesis is...

متن کامل

Sums of Prime Divisors and Mersenne Numbers

The study of the function β(n) originated in the paper of Nelson, Penney, and Pomerance [7], where the question was raised as to whether the set of Ruth-Aaron numbers (i.e., natural numbers n for which β(n) = β(n+ 1)) has zero density in the set of all positive integers. This question was answered in the affirmative by Erdős and Pomerance [5], and the main result of [5] was later improved by Po...

متن کامل

On irregular prime power divisors of the Bernoulli numbers

Let Bn (n = 0, 1, 2, . . .) denote the usual n-th Bernoulli number. Let l be a positive even integer where l = 12 or l ≥ 16. It is well known that the numerator of the reduced quotient Bl/l is a product of powers of irregular primes. Let (p, l) be an irregular pair with p below 12 million. We show that for every r ≥ 1 the congruence Bmr/mr ≡ 0 (mod p ) has a unique solution for mr where l ≡ mr ...

متن کامل

Chebyshev's bias for composite numbers with restricted prime divisors

Let π(x; d, a) denote the number of primes p ≤ x with p ≡ a(mod d). Chebyshev’s bias is the phenomenon for which “more often” π(x; d, n) > π(x; d, r), than the other way around, where n is a quadratic nonresidue mod d and r is a quadratic residue mod d. If π(x; d, n) ≥ π(x; d, r) for every x up to some large number, then one expects that N(x; d, n) ≥ N(x; d, r) for every x. Here N(x; d, a) deno...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences

سال: 2005

ISSN: 0386-2194

DOI: 10.3792/pjaa.81.17